Holonomy Decomposition of Seminearrings
نویسنده
چکیده
This work extends the Holcombe’s holonomy decomposition of near-rings to seminearrings employing the techniques of Eilenberg for studying the structure of transformation semigroups. This work investigates structural properties of certain types of seminearrings.
منابع مشابه
Algebraic hierarchical decomposition of finite state automata : a computational approach
The theory of algebraic hierarchical decomposition of finite state automata is an important and well developed branch of theoretical computer science (Krohn-Rhodes Theory). Beyond this it gives a general model for some important aspects of our cognitive capabilities and also provides possible means for constructing artificial cognitive systems: a Krohn-Rhodes decomposition may serve as a formal...
متن کاملThe Holonomy Decomposition of some Circular Semi-Flower Automata
Using holonomy decomposition, the absence of certain types of cycles in automata has been characterized. In the direction of studying the structure of automata with cycles, this paper focuses on a special class of semi-flower automata and establish the holonomy decomposition of certain circular semiflower automata. In particular, we show that the transformation monoid of a circular semi-flower ...
متن کاملThe Holonomy Decomposition of Circular Semi-Flower Automata
Eilenberg’s holonomy decomposition is useful to ascertain the structural properties of automata. Using this method, Egri-Nagy and Nehaniv characterized the absence of certain types of cycles in automata. In the direction of studying the structure of automata with cycles, this work focuses on a special class of semi-flower automata and establish the holonomy decompositions of certain circular se...
متن کاملExploration of the Space of Finite State Automata Using the Holonomy Decomposition∗
Algebraic theory of finite automata (Krohn-Rhodes Theory) is an important part of theoretical computer science although it has not achieved its full impact so far. The main decomposition theorem was proved in the 60’s [6] and further improved in the 70’s [5] but up until now there had never been a computational implementation. We implemented two different decompositions computationally and comp...
متن کاملCycle Structure in Automata and the Holonomy Decomposition
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be ‘understood’ using a hierarchical coordinate system. Here we use the holonomy decomposition for characterizing finite automata using derived hierarchical structure. This leads to a characterization according to the existence of different cycles within an automaton. The investigati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007